Some Variants of the Exponential Formula, with Application to the Multivariate Tutte Polynomial (alias Potts Model)
نویسندگان
چکیده
We prove some variants of the exponential formula and apply them to the multivariate Tutte polynomials (also known as Potts-model partition functions) of graphs. We also prove some further identities for the multivariate Tutte polynomial, which generalize an identity for counting connected graphs found by Riordan, Nijenhuis, Wilf and Kreweras and in more general form by Leroux and Gessel, and an identity for the inversion enumerator of trees found by Mallows, Riordan and Kreweras. Finally, we prove a generalization of Möbius inversion on the partition lattice.
منابع مشابه
Expected Lengths of Minimum Spanning Trees for Non-identical Edge Distributions
An exact general formula for the expected length of the minimal spanning tree (MST) of a connected (possibly with loops and multiple edges) graph whose edges are assigned lengths according to independent (not necessarily identical) distributed random variables is developed in terms of the multivariate Tutte polynomial (alias Potts model). Our work was inspired by Steele’s formula based on two-v...
متن کاملComplex zero-free regions at large |q| for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weights
We find zero-free regions in the complex plane at large |q| for the multivariate Tutte polynomial (also known in statistical mechanics as the Potts-model partition function) ZG(q,w) of a graph G with general complex edge weights w = {we}. This generalizes a result of Sokal [22] that applied only within the complex antiferromagnetic regime |1+we| ≤ 1. Our proof uses the polymer-gas representatio...
متن کاملThe multivariate Tutte polynomial (alias Potts model) for graphs and matroids
The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be defined on an arbitrary finite graph G, or more generally on an arbitrary matroid M , and encodes much important combinatorial information about the graph (indeed, in the matroid case it encodes the full structure of the matroid). It contains as a special case the familiar two-variable Tutte pol...
متن کاملZero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids
The chromatic polynomial PG(q) of a loopless graph G is known to be nonzero (with explicitly known sign) on the intervals (−∞, 0), (0, 1) and (1, 32/27]. Analogous theorems hold for the flow polynomial of bridgeless graphs and for the characteristic polynomial of loopless matroids. Here we exhibit all these results as special cases of more general theorems on real zero-free regions of the multi...
متن کاملTutte polynomials of wheels via generating functions
We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.
متن کامل